A Syntactical Treatment of Simultaneous Fixpoints in the Modal μ-Calculus
نویسنده
چکیده
We provide a purely syntactical treatment of simultaneous fixpoints in the modal μ-calculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness result for characteristic formulae of finite pointed transition systems.
منابع مشابه
The Modal Μ-calculus: a Survey
The modal μ-calculus is an extension of modal logic with two operators μ and ν, which give the least and greatest fixpoints of monotone operators on powersets. This powerful logic is widely used in computer science, in the area of verification of correctness of concurrent systems. In this survey we review both the theoretical aspects of the modal μ-calculus and its applications to computer scie...
متن کاملA Tableau Proof System with Names for Modal Mu-calculus
Howard Barringer was a pioneer in the study of temporal logics with fixpoints [1]. Their addition adds considerable expressive power. One general issue is how to define proof systems for such logics. Here we examine proof systems for modal logic with fixpoints. We present a tableau proof system for checking validity of formulas which uses names to keep track of unfoldings of fixpoint variables ...
متن کاملDeciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction
We construct, for any sentence Ψ of the modal μ calculus (Lμ), a derived sentence ΨML in the modal fragment ML of Lμ and a sentence ΨΠ μ 1 in the fragment Πμ1 of Lμ without least fixpoints such that Ψ is equivalent to a formula in ML or Πμ1 if and only if it is equivalent to ΨML or ΨΠ μ
متن کاملA Proof System with Names for Modal Mu-calculus
Fixpoints are an important ingredient in semantics, abstract interpretation and program logics. Their addition to a logic can add considerable expressive power. One general issue is how to define proof systems for such logics. Here we examine proof systems for modal logic with fixpoints [4]. We present a tableau proof system for checking validity of formulas which uses names to keep track of un...
متن کاملOn Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
The subject of this paper is Modal μ-Calculus, an extension of Modal Logic with operators for least and greatest fixpoints of monotone functions on sets. This logic, introduced by Kozen in [17], is a powerful formalism capable of expressing inductive as well as coinductive concepts and beyond (e.g. safety, liveness, fairness, termination, etc.) and is widely used in the area of verification of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007